Extension Study on Item-Based P-Tree Collaborative Filtering Algorithm for Netflix Prize

نویسندگان

  • Tingda Lu
  • Yan Wang
  • William Perrizo
  • Amal Perera
  • Gregory H. Wettstein
چکیده

Recommendation systems provide customers with personalized recommendations by analyzing the purchase history. Item-based Collaborative Filtering (CF) algorithms recommend items which are similar to what the customers purchased before. Item-based algorithms are widely employed over user-based algorithms due to less computational complexity and better accuracy. We implement several types of item-based CF algorithms with P-Tree data structure. Similarity corrections and item effects are further included in the algorithms to exclude support and item variance. Our experiment on Netflix Prize data suggests support based similarity corrections and item effects have an significant impact on the prediction accuracy. Pearson and SVD item-feature similarity algorithms with support based similarity correction and item effects achieve better RMSE scores.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

P-Tree Singular Value Decomposition Item-Feature Collaborative Filtering Algorithm for Netflix Prize

Collaborative Filtering is effective to provide customers with personalized recommendations by analyzing the purchase pattens. Matrix factorization, e.g. Singular Value Decomposition, is another successful technique in recommendation system. We implemented Singular Value Decomposition algorithm to achieve the least total squared errors. Based on the result, item-feature Collaborative Filtering ...

متن کامل

An algorithm for efficient privacy-preserving item-based collaborative filtering

Collaborative filtering (CF) methods are widely adopted by existing recommender systems, which can analyze and predict user ‘‘ratings’’ or ‘‘preferences’’ of newly generated items based on user historical behaviors. However, privacy issue arises in this process as sensitive user private data are collected by the recommender server. Recently proposed privacy-preserving collaborative filtering (P...

متن کامل

Collaborative Filtering via Ensembles of Matrix Factorizations

We present a Matrix Factorization (MF) based approach for the Netflix Prize competition. Currently MF based algorithms are popular and have proved successful for collaborative filtering tasks. For the Netflix Prize competition, we adopt three different types of MF algorithms: regularized MF, maximum margin MF and non-negative MF. Furthermore, for each MF algorithm, instead of selecting the opti...

متن کامل

Design of Movie Recommendation System by Means of Collaborative Filtering

The purpose of this study is to develop a ‘Movie Recommendation System’ with the help of Collaborative Filtering approach. For this purpose we have used the Netflix prize dataset which is available for download from www.netflix.com. This dataset contains huge number of files. There are total 480189 users who have rated the movies. For clustering the users in the dataset according to their respe...

متن کامل

Predicting User Preference for Movies using NetFlix database

Online content and service providers deal with the problem of providing “relevant” content on a regular basis, especially due to the sheer volume of data available. This work deals with one such problem, namely, that of predicting user preference for movies using the NetFlix database. We present a memory-based Collaborative Filtering (CF) algorithm that learns the personality traits of the user...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010